Knowledge-Based Approaches to Scheduling Problems: A Survey

نویسندگان

  • S. J. Noronha
  • V. V. S. Sarma
چکیده

Scheduling is the process of devising or designing a procedure for a particular objective, specifying the sequence or time for each item in the procedure. Qpical scheduling problems are railway time-tabling, project scheduling, production scheduling, and scheduling computer systems as in flexible manufacturing systems and multiprocessor scheduling. Further, there are a number of related problems belonging to the larger class of planning problems, such as the early stage of project management and resource allocation in a job shop. Scheduling is a rich area demanding the application of efficient methods to tackle the combinatorial explosion that results in real world applications. Recent developments in artificial intelligence (AI) have led to the use of knowledge-based techniques for solving scheduling problems. In this paper, we survey several existing intelligent planning and scheduling systems with the aim of providing a guide to the main AI techniques used. In view of the prevailing difference in usage of the terms planning and scheduling between AI and OR, we present a taxonomy of planning and scheduling problems. We illustrate the modeling of real world problems b m closed deterministic worlds to complex real worlds with the project scheduling example. We survey some of the more successful planning and scheduling systems, and highlight their features. Finally, we consolidate the AI approaches to knowledge representation and problem solving in the project management context. Index TernIntelligent systems, knowledge-based systems, planning, project management, scheduling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

متن کامل

Supply Chain Scheduling Using a Transportation System Composed of Vehicle Routing Problem and Cross-Docking Approaches

This study considers a combination of cross-docking and vehicle routing problem (VRP) approachesto transport raw material and parts in a supply chain. The supply chain is composed of some supplierswhich are spread in different geographical zones and multiple shared vehicles with different speedsand capacities for transporting orders from the suppliers to a manufacturer. After ...

متن کامل

A new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

متن کامل

Multi-objective Solution Approaches for Employee Shift Scheduling Problems in Service Sectors (RESEARCH NOTE)

Today, workforce scheduling programs are being implemented in many production and service centers. These sectors can provide better quality products and/or services to their customers, taking into account employees’ desires and preferences in order to increase sector productivity. In this study, an employee shift scheduling problem in the service sector is discussed. In the problem, the aim is ...

متن کامل

مقایسه و تحلیلی بر استفاده از الگوریتم های فراابتکاری برای حل مسائل زمانبندی تولید کارگاهی

One of the most important problems in research and applied fields of production management is a suitable scheduling for different operations. So, there are many approaches for job workshop or job non-workshop scheduling problems. Since job workshop scheduling problems (JSP) belong to NP-Hard class, some metaheuristics methods such as Tabu Search, Simulated Annealing, Genetic Algorithm and Parti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Knowl. Data Eng.

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1991